2001 Paper 4 Question 8 Computation Theory (a) Define precisely what is meant by the following: (i ) f (x1 , x2 , . . . xn ) is a Primitive Recursive (PR) function of arity n. [5 marks]

Source URL: www.cl.cam.ac.uk

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the Uniform Weak K¨onig’s Lemma On the Uniform Weak K¨onig’s Lemma

Source URL: www.brics.dk

• Proof theory
• Computability theory
• Functions and mappings
• Reverse mathematics
• Mathematical proofs
• Primitive recursive function
• Gödel–Gentzen negative translation
• Primitive recursive arithmetic
• Second-order arithmetic
• Mathematics
• Mathematical logic
• Logic

Sober Spaces and Continuations Paul Taylor August 5, 2003 Abstract A topological space is sober if it has exactly the points that are dictated by its open sets. We explain the analogy with the way in which computational

Source URL: www.paultaylor.eu

• Functions and mappings
• Theoretical computer science
• Formal methods
• Models of computation
• Model theory
• Symbol
• Lambda calculus
• Interpretation
• Primitive recursive function
• Mathematics
• Mathematical logic
• Computability theory

Submitted to Sci. Math. Japonicae 1 Limiting rst order realizability interpretation Masahiro Nakata and Susumu Hayashi

Source URL: www.shayashi.jp

• Theory of computation
• Computability theory
• Function
• Integral calculus
• Primitive recursive function
• Fundamental theorem of calculus
• Mathematics
• Mathematical analysis
• Functions and mappings

Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe1,2 Benjamin Gr´egoire1,3 Santiago Zanella1,3

Source URL: certicrypt.gforge.inria.fr

• Function
• XTR
• Computability theory
• Model theory
• Μ operator
• Primitive recursive function
• Mathematics
• Mathematical logic
• Functions and mappings

UTP Theories of Undefinedness Jim Woodcock & Victor Bandur University of York UTP Symposium, Paris: 27 August

Source URL: utp12.lri.fr

• Computability theory
• Formal methods
• Model theory
• Models of computation
• Lambda calculus
• Predicate
• Interpretation
• Function
• Primitive recursive function
• Logic
• Mathematical logic
• Mathematics

MUTUAL COOPERATION AND UNILATERAL ALTRUISM IN A ONE-SHOT PRISONER’S DILEMMA - A COMPUTABILITY APPROACH MIKIO NAKAYAMA Abstract. We consider the one-shot Prisoner’s Dilemma played by programs or machines, and show tha

Source URL: ies.keio.ac.jp

• Theory of computation
• Theoretical computer science
• Functions and mappings
• Function
• Computable function
• Equivalence relation
• Recursion
• Primitive recursive function
• Μ operator
• Mathematics
• Computability theory
• Mathematical logic

Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe1,2 Benjamin Gr´egoire1,3 Santiago Zanella1,3

Source URL: software.imdea.org

• Function
• XTR
• Computability theory
• Model theory
• Μ operator
• Primitive recursive function
• Mathematics
• Mathematical logic
• Functions and mappings

Well-founded Recursion over Contextual Objects Brigitte Pientka1 and Andreas Abel2 1 2

Source URL: www2.tcs.ifi.lmu.de

• Functions and mappings
• Model theory
• Computability theory
• Interpretation
• Philosophy of mind
• Semantics
• Primitive recursive function
• Function
• First-order logic
• Mathematical logic
• Mathematics
• Logic

Structural Recursion over Contextual Objects Brigitte Pientka and Sherry Shanshan Ruan Andreas Abel School of Computer Science

Source URL: www2.tcs.ifi.lmu.de

• Functions and mappings
• Model theory
• Formal languages
• Metalogic
• Computability theory
• Symbol
• Interpretation
• Primitive recursive function
• Substitution
• Logic
• Mathematics
• Mathematical logic